On the Index of Farey Sequences
نویسندگان
چکیده
For any two consecutive Farey fractions γi = ai/qi < γi+1 = ai+1/qi+1, one has ai+1qi − aiqi+1 = 1 and qi + qi+1 > Q. Conversely, if q and q ′ are two coprime integers in {1, . . . , Q} with q + q > Q, then there are unique a ∈ {1, . . . , q} and a ∈ {1, . . . , q} for which aq − aq = 1, and a/q < a/q are consecutive Farey fractions of order Q. Therefore, the pairs of coprime integers (q, q) with q + q > Q are in one-to-one correspondence with the pairs of consecutive Farey fractions of order Q. Moreover, the denominator qi+2 of γi+2 can be easily expressed (cf. [5]) by means of the denominators of γi and γi+1 as qi+2 = [
منابع مشابه
On Boolean Lattices and Farey Sequences
We establish monotone bijections between subsequences of the Farey sequences and the halfsequences of Farey subsequences associated with elements of the Boolean lattices.
متن کاملA Note on Boolean Lattices and Farey Sequences. Ii
We establish monotone bijections between subsequences of the Farey sequences and the halfsequences of Farey subsequences associated with elements of the Boolean lattices.
متن کامل2 00 8 a Note on Boolean Lattices and Farey Sequences . Ii
We establish monotone bijections between subsequences of the Farey sequences and the halfsequences of Farey subsequences associated with elements of the Boolean lattices.
متن کاملA Note on Boolean Lattices and Farey Sequences
We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related combinatorial identities. Subject class: 05A19, 11B65.
متن کاملOrder Statistics in the Farey Sequences in Sublinear Time
The paper presents the first sublinear algorithm for computing order statistics in the Farey sequences. The algorithm runs in time O(n log n) and in space O( √ n ) for Farey sequence of order n. This is a significant improvement to the algorithm from [1] that runs in time O(n log n).
متن کامل